|
In graph theory, a circulant graph is an undirected graph that has a cyclic group of symmetries that includes a symmetry taking any vertex to any other vertex. ==Equivalent definitions== Circulant graphs can be described in several equivalent ways:〔.〕 *The automorphism group of the graph includes a cyclic subgroup that acts transitively on the graph's vertices. *The graph has an adjacency matrix that is a circulant matrix. *The vertices of the graph can be numbered from 0 to in such a way that, if some two vertices numbered and are adjacent, then every two vertices numbered and are adjacent. *The graph can be drawn (possibly with crossings) so that its vertices lie on the corners of a regular polygon, and every rotational symmetry of the polygon is also a symmetry of the drawing. *The graph is a Cayley graph of a cyclic group.〔.〕 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「circulant graph」の詳細全文を読む スポンサード リンク
|